Construction of Thinned Gated Single-Assignment Form
نویسنده
چکیده
Analysis of symbolic expressions beneets from a suitable program representation. We show how to build thinned gated single-assignment (TGSA) form, a value-oriented program representation which is more complete than standard SSA form, deened on all reducible programs , and better for representing symbolic expressions than program dependence graphs or original GSA form. We present practical algorithms for constructing thinned GSA form from the control dependence graph and SSA form. Extensive experiments on large Fortran programs show these methods to take linear time and space in practice. Our implementation of value numbering on TGSA form drives scalar symbolic analysis in the ParaScope programming environment.
منابع مشابه
Efficiently Building the Gated Single Assignment Form in Codes with Pointers in Modern Optimizing Compilers
Understanding program behavior is at the foundation of program optimization. Techniques for automatic recognition of program constructs characterize the behavior of code fragments, providing compilers with valuable information to guide code optimizations. The XARK compiler framework provides a complete, robust and extensible solution to the automatic recognition problem that was shown to be eff...
متن کامل-SSA and its Construction through Symbolic Interpretation
In this paper, we propose a new variant of SSA called-SSA and discuss its construction through symbolic interpretation of programs. By relaxing a condition of SSA form without violating the fundamental nature of static single assignment,-SSA form results in a representation which uses fewer join functions than the minimal SSA form. A graph representation called Value Flow Graph (VFG) is used to...
متن کاملSimple and Efficient Construction of Static Single Assignment Form
We present a simple SSA construction algorithm, which allows direct translation from an abstract syntax tree or bytecode into an SSA-based intermediate representation. The algorithm requires no prior analysis and ensures that even during construction the intermediate representation is in SSA form. This allows the application of SSA-based optimizations during construction. After completion, the ...
متن کاملMinimal Static Single Assignment Form
This formalization is an extension to [3]. In their work, the authors have shown that Braun et al.’s static single assignment (SSA) construction algorithm [1] produces minimal SSA form for input programs with a reducible control flow graph (CFG). However Braun et al. also proposed an extension to their algorithm that they claim produces minimal SSA form even for irreducible CFGs. In this formal...
متن کاملPrioritizing Target Markets for the Export of Iran Construction Services
Abstract T ire cent decades, the internationalization of trade and companies' engagement in the global market has been found with a double significance. Planning and investment to increase the share of non-oil exports in total exports and reform its combination to export of goods and services with higher technology are of approaches of vision plan that export of Construction Services ...
متن کامل